THE COMPUTATIONAL COMPLEXITY OF CONVEX BODIES Alexander Barvinok and Ellen Veomett October 2006 Abstract. We discuss how well a given convex body B in a real d-dimensional vector space V can be approximated by a set X f

Source URL: www.math.lsa.umich.edu

• Geometry
• Mathematics
• Space
• Polytopes
• Operations research
• Convex analysis
• Real algebraic geometry
• Linear algebra
• Simplex
• Linear programming
• Mathematical optimization
• Convex hull

6.006 Intro to Algorithms Recitation 24 May 6, 2011

Source URL: courses.csail.mit.edu

• Geometry
• Mathematics
• Space
• Convex analysis
• Convex geometry
• Convex hull algorithms
• Computational geometry
• Euclidean plane geometry
• Convex hull
• Convex set
• Convex polygon
• Convex function

CONES OF HILBERT FUNCTIONS MATS BOIJ AND GREGORY G. SMITH A BSTRACT. We study the closed convex hull of various collections of Hilbert functions. Working over a standard graded polynomial ring with modules that are gener

Source URL: www.mast.queensu.ca

Convex Hull of Points Lying on Lines in o(n log n) Time after PreprocessingI Esther Ezraa,1 , Wolfgang Mulzerb,2 a Courant Institute of Mathematical Sciences, New York University, New York, USA b Institut f¨

Source URL: page.mi.fu-berlin.de

CCCG 2008, Montr´eal, Qu´ebec, August 13–15, 2008 Data Structures for Restricted Triangular Range Searching Nadia M. Benbernou∗ Mashhood Ishaque†

Source URL: www.eecs.tufts.edu

• Computing
• Computer science
• Data management
• Database theory
• Search algorithms
• Range searching
• Range tree
• Fractional cascading
• Computational geometry
• Range query
• Bin
• Dynamic convex hull

Randomized Triangle Algorithms for Convex Hull Membership Bahman Kalantari∗ Abstract angle algorithm performs quite well when compared

Source URL: fwcg14.cse.uconn.edu

Experimental Study of The Convex Hull Decision Problem Via a New Geometric Algorithm Meng Li∗ Bahman Kalantari∗

Source URL: www-cs.engr.ccny.cuny.edu

Random points in halfspheres∗ Imre B´ar´any, Daniel Hug, Matthias Reitzner, Rolf Schneider Abstract A random spherical polytope Pn in a spherically convex set K ⊂ S d as considered here is the spherical convex hull

Source URL: home.mathematik.uni-freiburg.de

On Computing the Convex Hull of (Piecewise) Curved Objects Franz Aurenhammer and Bert J¨ uttler Abstract. We utilize support functions to transform the problem of constructing the convex hull of a finite set of curved o

Source URL: www.igi.tugraz.at

B 4. References 1 Bhattacharya B K, ElGindy H. A new linear convex hull algorithm for simple polygons. IEEE Transactions on Information

Source URL: cgm.cs.mcgill.ca